Threshold Multi Secret Sharing Using Elliptic Curve and Pairing

Secret Sharing techniques are now the building blocks of several security protocols. A (t, n) threshold secret sharing scheme is one in which t or more participant can join together to retrieve the secret.Traditional single secret sharing schemes are modified and generalized to share multiple secrets.Use of elliptic curve and pairing in secret sharing is gaining more importance.In this paper we propose a threshold multi secret sharing scheme where more than one secret is shared.When the threshold number of participants collate, the multi secret can be retrieved. The scheme make use of elliptic curve and bilinear pairing.Verification of shares by the participants, shares consistency checking, detection and identification of cheaters are the extended capabilities achieved.The shared secrets are retrieved in single stage here, unlike the multi stage secret sharing scheme.The participants can be added very easily.The scheme is efficient and the number of public parameters are also less compared with the existing threshold multi secret sharing scheme based on the elliptic curve.The dealer can easily modify the secret or add additional secret by changing the public parameters of the scheme.This is the first proposal of a threshold multi secret sharing scheme with extended capabilities using self pairing.